A p-adic condition on the weight of a codeword of a linear code
نویسنده
چکیده
A condition on the weight of a codeword of a linear code is obtained using polynomials over the p-adic numbers. This condition is obtained by proving a bound on the size of a t-fold blocking set of hyperplanes in a finite affine space.
منابع مشابه
p-adic Shearlets
The field $Q_{p}$ of $p$-adic numbers is defined as the completion of the field of the rational numbers $Q$ with respect to the $p$-adic norm $|.|_{p}$. In this paper, we study the continuous and discrete $p-$adic shearlet systems on $L^{2}(Q_{p}^{2})$. We also suggest discrete $p-$adic shearlet frames. Several examples are provided.
متن کاملFiltrations of smooth principal series and Iwasawa modules
Let $G$ be a reductive $p$-adic group. We consider the general question of whether the reducibility of an induced representation can be detected in a ``co-rank one" situation. For smooth complex representations induced from supercuspidal representations, we show that a sufficient condition is the existence of a subquotient that does not appear as a subrepresentation. An import...
متن کامل$p$-adic Dual Shearlet Frames
We introduced the continuous and discrete $p$-adic shearlet systems. We restrict ourselves to a brief description of the $p$-adic theory and shearlets in real case. Using the group $G_p$ consist of all $p$-adic numbers that all of its elements have a square root, we defined the continuous $p$-adic shearlet system associated with $L^2left(Q_p^{2}right)$. The discrete $p$-adic shearlet frames for...
متن کاملA Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code
Recently, Wang, Yin, and Yu ([WYY05b]) have used a low weight codeword in the SHA-1 message expansion to show a better than brute force method to find collisions in SHA-1. The smallest minimum weight codeword they report has a (bit) weight of 25 in the last 60 of the 80 expanded words. In this paper we show, using a computer assisted method, that this is indeed the smallest weight codeword. In ...
متن کاملLocal Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code
Local weight distribution is the weight distribution of minimal codewords in a linear code. We give the local weight distribution of the (256, 93) third-order binary Reed-Muller code. For the computation, a coset partitioning algorithm is modified by using a binary shift invariance property. This reduces the time complexity by about 1/256 for the code. A necessary and sufficient condition for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 72 شماره
صفحات -
تاریخ انتشار 2014